Twice differentiable characterizations of convexity notions for functions on full dimensional convex sets
نویسنده
چکیده
We derive C2−characterizations for convex, strictly convex, as well as uniformly convex functions on full dimensional convex sets. In the cases of convex and uniformly convex functions this weakens the wellknown openness assumption on the convex sets. We also show that, in a certain sense, the full dimensionality assumption cannot be weakened further. In the case of strictly convex functions we weaken the well-known sufficient C2−condition for strict convexity to a characterization. Several examples illustrate the results.
منابع مشابه
Convexity and Geodesic Metric Spaces
In this paper, we first present a preliminary study on metric segments and geodesics in metric spaces. Then we recall the concept of d-convexity of sets and functions in the sense of Menger and study some properties of d-convex sets and d-convex functions as well as extreme points and faces of d-convex sets in normed spaces. Finally we study the continuity of d-convex functions in geodesic metr...
متن کاملA note on Alexsandrov type theorem for k-convex functions
A classical result of Alexsandrov [1] asserts that convex functions in R are twice differentiable a.e., (see also [3], [8] for more modern treatments). It is well known that Sobolev functions u ∈ W , for p > n/2 are twice differentiable a.e.. The following weaker notion of convexity known as k-convexity was introduced by Trudinger and Wang [12, 13]. Let Ω ⊂ R be an open set and C(Ω) be the clas...
متن کاملModelling with twice continuously differentiable functions ∗
Many real life situations can be described using twice continuously differentiable functions over convex sets with interior points. Such functions have an interesting separation property: At every interior point of the set they separate particular classes of quadratic convex functions from classes of quadratic concave functions. Using this property we introduce new characterizations of the deri...
متن کاملNew optimality conditions for multiobjective fuzzy programming problems
In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables. Based on a new $p$-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.
متن کاملOn Uniform Convexity, Total Convexity and Convergence of the Proximal Point and Outer Bregman Projection Algorithms in Banach Spaces
In this paper we study and compare the notions of uniform convexity of functions at a point and on bounded sets with the notions of total convexity at a point and sequential consistency of functions, respectively. We establish connections between these concepts of strict convexity in infinite dimensional settings and use the connections in order to obtain improved convergence results concerning...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011